Some ternary and quaternary codes and associated sphere packings
نویسندگان
چکیده
Tables are presented of good ternary and quaternary codes and they are used in the construction of dense sphere packings. Results include 1) tables of the best ternary and quaternary constacyclic codes (including cyclic codes) up to block length 50, 2 ) a class of optimal [ n , 21 codes over GF(q), 3) the ( U + U + w I2u + U I U ) construction, a new ternary code construction technique that can be used to construct the ternary Reed-Muller codes (and others), and 4) tables of linear ternary and quaternary codes obtained by modifying and combining various codes discovered here and in the literature. Using these codes and a sphere-packing construction, packings are generated in even dimensions up to 100. In dimensions 36 and 60, new record densities appear to have been achieved.
منابع مشابه
Dense Sphere Packings from New Codes
The idea behind the coset code construction (see [G.D. Forney, Coset Codes, IEEE Transactions on Information Theory, Part I: Introduction and Geometrical Classification, pp. 1123–1151; Part II: Binary lattices and related codes, pp. 1152–1187; F.R. Kschischang and S. Pasupathy, IEEE Transactions on Information Theory 38 (1992), 227–246.]) is to reduce the construction of sphere packings to erro...
متن کاملSphere Packings and Error-correcting Codes
Error-correcting codes are used in several constructions for packings of equal spheres in ^-dimensional Euclidean spaces E. These include a systematic derivation of many of the best sphere packings known, and construction of new packings in dimensions 9-15, 36, 40, 48, 60, and 2 for m g 6. Most of the new packings are nonlattice packings. These new packings increase the previously greatest know...
متن کاملDensity Doubling, Double-circulants, and New Sphere Packings
New nonlattice sphere packings in dimensions 20, 22, and 44–47 that are denser than the best previously known sphere packings were recently discovered. We extend these results, showing that the density of many sphere packings in dimensions just below a power of 2 can be doubled using orthogonal binary codes. This produces new dense sphere packings in Rn for n = 25, 26, . . . , 31 and 55, 56, . ...
متن کاملCodes over GF(4) and Complex Lattices
The connections between binary and ternary error-correcting codes on the one hand, and lattices and sphere-packings in W on the other have been studied by several authors [6,7, 19-21,26,29,30,39,40-j. Since the theorem of Gleason, Pierce and Turyn [l, p. 381; 21 states that codes over GF(2), GF(3) and GF(4) have especially nice properties not shared by codes over other fields, one might expect ...
متن کاملNew Ternary and Quaternary Equidistant Constant Weight Codes
We consider the problem of finding bounds on the size of ternary and quaternary equidistant constant weight codes. We present a computer realization of an algorithm for solving the maximum clique problem. We use it for finding the exact values of the maximum size for ternary and quaternary equidistant constant weight codes for all open cases for n ≤ 10 are found.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 38 شماره
صفحات -
تاریخ انتشار 1992